TSTP Solution File: SET601^3 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SET601^3 : TPTP v8.1.2. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n014.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:07:28 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 29
% Syntax : Number of formulae : 125 ( 19 unt; 19 typ; 0 def)
% Number of atoms : 1433 ( 232 equ; 0 cnn)
% Maximal formula atoms : 5 ( 13 avg)
% Number of connectives : 1054 ( 35 ~; 261 |; 120 &; 631 @)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 107 ( 107 >; 0 *; 0 +; 0 <<)
% Number of symbols : 29 ( 26 usr; 9 con; 0-3 aty)
% Number of variables : 75 ( 58 ^ 9 !; 6 ?; 75 :)
% ( 2 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(func_def_0,type,
in: $i > ( $i > $o ) > $o ).
thf(func_def_2,type,
is_a: $i > ( $i > $o ) > $o ).
thf(func_def_3,type,
emptyset: $i > $o ).
thf(func_def_4,type,
unord_pair: $i > $i > $i > $o ).
thf(func_def_5,type,
singleton: $i > $i > $o ).
thf(func_def_6,type,
union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_7,type,
excl_union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_8,type,
intersection: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_9,type,
setminus: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(func_def_10,type,
complement: ( $i > $o ) > $i > $o ).
thf(func_def_11,type,
disjoint: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_12,type,
subset: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_13,type,
meets: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_14,type,
misses: ( $i > $o ) > ( $i > $o ) > $o ).
thf(func_def_15,type,
vEPSILON:
!>[X0: $tType] : ( ( X0 > $o ) > X0 ) ).
thf(func_def_29,type,
sK0: $i > $o ).
thf(func_def_30,type,
sK1: $i > $o ).
thf(func_def_31,type,
sK2: $i > $o ).
thf(func_def_33,type,
ph4:
!>[X0: $tType] : X0 ).
thf(f343,plain,
$false,
inference(avatar_sat_refutation,[],[f275,f285,f291,f319,f322,f326,f334,f337,f342]) ).
thf(f342,plain,
( ~ spl3_2
| ~ spl3_6 ),
inference(avatar_contradiction_clause,[],[f341]) ).
thf(f341,plain,
( $false
| ~ spl3_2
| ~ spl3_6 ),
inference(trivial_inequality_removal,[],[f340]) ).
thf(f340,plain,
( ( $true = $false )
| ~ spl3_2
| ~ spl3_6 ),
inference(backward_demodulation,[],[f267,f307]) ).
thf(f307,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ~ spl3_6 ),
inference(avatar_component_clause,[],[f305]) ).
thf(f305,plain,
( spl3_6
<=> ( $false
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_6])]) ).
thf(f267,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f265]) ).
thf(f265,plain,
( spl3_2
<=> ( $true
= ( sK0 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_2])]) ).
thf(f337,plain,
( ~ spl3_1
| ~ spl3_4 ),
inference(avatar_contradiction_clause,[],[f336]) ).
thf(f336,plain,
( $false
| ~ spl3_1
| ~ spl3_4 ),
inference(trivial_inequality_removal,[],[f335]) ).
thf(f335,plain,
( ( $true = $false )
| ~ spl3_1
| ~ spl3_4 ),
inference(forward_demodulation,[],[f263,f299]) ).
thf(f299,plain,
( ( ( sK1 @ sK5 )
= $false )
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f297]) ).
thf(f297,plain,
( spl3_4
<=> ( ( sK1 @ sK5 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_4])]) ).
thf(f263,plain,
( ( ( sK1 @ sK5 )
= $true )
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f261]) ).
thf(f261,plain,
( spl3_1
<=> ( ( sK1 @ sK5 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_1])]) ).
thf(f334,plain,
( ~ spl3_3
| ~ spl3_5 ),
inference(avatar_contradiction_clause,[],[f333]) ).
thf(f333,plain,
( $false
| ~ spl3_3
| ~ spl3_5 ),
inference(trivial_inequality_removal,[],[f332]) ).
thf(f332,plain,
( ( $true = $false )
| ~ spl3_3
| ~ spl3_5 ),
inference(forward_demodulation,[],[f271,f303]) ).
thf(f303,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f301]) ).
thf(f301,plain,
( spl3_5
<=> ( $false
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_5])]) ).
thf(f271,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f269]) ).
thf(f269,plain,
( spl3_3
<=> ( $true
= ( sK2 @ sK5 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl3_3])]) ).
thf(f326,plain,
( spl3_4
| spl3_5 ),
inference(avatar_split_clause,[],[f100,f301,f297]) ).
thf(f100,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f98]) ).
thf(f98,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f97]) ).
thf(f97,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(duplicate_literal_removal,[],[f96]) ).
thf(f96,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f95]) ).
thf(f95,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f93]) ).
thf(f93,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( $false
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f74]) ).
thf(f74,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false )
| ( $false
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f73]) ).
thf(f73,plain,
( ( $false
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f71]) ).
thf(f71,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f69,plain,
( ( ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f68]) ).
thf(f68,plain,
( ( $false
= ( ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f66,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
!= ( ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) ) ),
inference(beta_eta_normalization,[],[f65]) ).
thf(f65,plain,
( ( ^ [Y0: $i] :
( ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
& ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) )
@ sK5 )
!= ( ^ [Y0: $i] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) )
@ sK5 ) ),
inference(negative_extensionality,[],[f64]) ).
thf(f64,plain,
( ( ^ [Y0: $i] :
( ( ( sK1 @ Y0 )
| ( sK0 @ Y0 ) )
& ( ( sK2 @ Y0 )
| ( sK1 @ Y0 ) )
& ( ( sK0 @ Y0 )
| ( sK2 @ Y0 ) ) ) )
!= ( ^ [Y0: $i] :
( ( ( sK2 @ Y0 )
& ( sK0 @ Y0 ) )
| ( ( sK1 @ Y0 )
& ( sK2 @ Y0 ) )
| ( ( sK0 @ Y0 )
& ( sK1 @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f63]) ).
thf(f63,plain,
( ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK0
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK1
@ sK2 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ sK2
@ sK0 ) ) )
!= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK0
@ sK1 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK1
@ sK2 )
@ ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) )
@ sK2
@ sK0 ) ) ) ),
inference(definition_unfolding,[],[f54,f51,f58,f51,f58,f58,f58,f51,f58,f51,f51]) ).
thf(f58,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f42]) ).
thf(f42,plain,
( union
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y1 @ Y2 )
| ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f41]) ).
thf(f41,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X0 @ X2 )
| ( X1 @ X2 ) ) )
= union ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X0 @ X3 )
| ( X2 @ X3 ) ) )
= union ),
file('/export/starexec/sandbox2/tmp/tmp.IzwTwQxVnu/Vampire---4.8_14130',union) ).
thf(f51,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f36]) ).
thf(f36,plain,
( intersection
= ( ^ [Y0: $i > $o,Y1: $i > $o,Y2: $i] :
( ( Y0 @ Y2 )
& ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f35]) ).
thf(f35,plain,
( ( ^ [X0: $i > $o,X1: $i > $o,X2: $i] :
( ( X1 @ X2 )
& ( X0 @ X2 ) ) )
= intersection ),
inference(rectify,[],[f8]) ).
thf(f8,axiom,
( ( ^ [X0: $i > $o,X2: $i > $o,X3: $i] :
( ( X2 @ X3 )
& ( X0 @ X3 ) ) )
= intersection ),
file('/export/starexec/sandbox2/tmp/tmp.IzwTwQxVnu/Vampire---4.8_14130',intersection) ).
thf(f54,plain,
( ( intersection @ ( union @ sK0 @ sK1 ) @ ( intersection @ ( union @ sK1 @ sK2 ) @ ( union @ sK2 @ sK0 ) ) )
!= ( union @ ( intersection @ sK0 @ sK1 ) @ ( union @ ( intersection @ sK1 @ sK2 ) @ ( intersection @ sK2 @ sK0 ) ) ) ),
inference(cnf_transformation,[],[f46]) ).
thf(f46,plain,
( ( intersection @ ( union @ sK0 @ sK1 ) @ ( intersection @ ( union @ sK1 @ sK2 ) @ ( union @ sK2 @ sK0 ) ) )
!= ( union @ ( intersection @ sK0 @ sK1 ) @ ( union @ ( intersection @ sK1 @ sK2 ) @ ( intersection @ sK2 @ sK0 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f44,f45]) ).
thf(f45,plain,
( ? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ ( intersection @ X0 @ X1 ) @ ( union @ ( intersection @ X1 @ X2 ) @ ( intersection @ X2 @ X0 ) ) )
!= ( intersection @ ( union @ X0 @ X1 ) @ ( intersection @ ( union @ X1 @ X2 ) @ ( union @ X2 @ X0 ) ) ) )
=> ( ( intersection @ ( union @ sK0 @ sK1 ) @ ( intersection @ ( union @ sK1 @ sK2 ) @ ( union @ sK2 @ sK0 ) ) )
!= ( union @ ( intersection @ sK0 @ sK1 ) @ ( union @ ( intersection @ sK1 @ sK2 ) @ ( intersection @ sK2 @ sK0 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f44,plain,
? [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ ( intersection @ X0 @ X1 ) @ ( union @ ( intersection @ X1 @ X2 ) @ ( intersection @ X2 @ X0 ) ) )
!= ( intersection @ ( union @ X0 @ X1 ) @ ( intersection @ ( union @ X1 @ X2 ) @ ( union @ X2 @ X0 ) ) ) ),
inference(ennf_transformation,[],[f43]) ).
thf(f43,plain,
~ ! [X0: $i > $o,X1: $i > $o,X2: $i > $o] :
( ( union @ ( intersection @ X0 @ X1 ) @ ( union @ ( intersection @ X1 @ X2 ) @ ( intersection @ X2 @ X0 ) ) )
= ( intersection @ ( union @ X0 @ X1 ) @ ( intersection @ ( union @ X1 @ X2 ) @ ( union @ X2 @ X0 ) ) ) ),
inference(rectify,[],[f16]) ).
thf(f16,negated_conjecture,
~ ! [X0: $i > $o,X2: $i > $o,X4: $i > $o] :
( ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X4 ) @ ( intersection @ X4 @ X0 ) ) )
= ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X4 ) @ ( union @ X4 @ X0 ) ) ) ),
inference(negated_conjecture,[],[f15]) ).
thf(f15,conjecture,
! [X0: $i > $o,X2: $i > $o,X4: $i > $o] :
( ( union @ ( intersection @ X0 @ X2 ) @ ( union @ ( intersection @ X2 @ X4 ) @ ( intersection @ X4 @ X0 ) ) )
= ( intersection @ ( union @ X0 @ X2 ) @ ( intersection @ ( union @ X2 @ X4 ) @ ( union @ X4 @ X0 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.IzwTwQxVnu/Vampire---4.8_14130',thm) ).
thf(f322,plain,
( spl3_6
| spl3_4 ),
inference(avatar_split_clause,[],[f116,f297,f305]) ).
thf(f116,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f114]) ).
thf(f114,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f113]) ).
thf(f113,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) ) ),
inference(duplicate_literal_removal,[],[f112]) ).
thf(f112,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f110]) ).
thf(f110,plain,
( ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f109]) ).
thf(f109,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(duplicate_literal_removal,[],[f108]) ).
thf(f108,plain,
( ( ( sK1 @ sK5 )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $false ) ),
inference(binary_proxy_clausification,[],[f72]) ).
thf(f72,plain,
( ( ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) )
= $false )
| ( ( sK1 @ sK5 )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f71]) ).
thf(f319,plain,
( spl3_5
| spl3_6 ),
inference(avatar_split_clause,[],[f132,f305,f301]) ).
thf(f132,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f131]) ).
thf(f131,plain,
( ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f130]) ).
thf(f130,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f129]) ).
thf(f129,plain,
( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( $false
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f127]) ).
thf(f127,plain,
( ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK2 @ sK5 ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f125]) ).
thf(f125,plain,
( ( $false
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false )
| ( ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f124]) ).
thf(f124,plain,
( ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false )
| ( $false
= ( sK0 @ sK5 ) )
| ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f122]) ).
thf(f122,plain,
( ( $false
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( $false
= ( sK0 @ sK5 ) )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f70]) ).
thf(f70,plain,
( ( $false
= ( sK0 @ sK5 ) )
| ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $false )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $false ) ),
inference(binary_proxy_clausification,[],[f69]) ).
thf(f291,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f195,f265,f261]) ).
thf(f195,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f194]) ).
thf(f194,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f192]) ).
thf(f192,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f191]) ).
thf(f191,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f189]) ).
thf(f189,plain,
( ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f175]) ).
thf(f175,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f174]) ).
thf(f174,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f173]) ).
thf(f173,plain,
( ( $true
= ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f172]) ).
thf(f172,plain,
( ( $true
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f171]) ).
thf(f171,plain,
( ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( $true
= ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f67,plain,
( ( $true
= ( ( ( sK1 @ sK5 )
| ( sK0 @ sK5 ) )
& ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) ) )
| ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f66]) ).
thf(f285,plain,
( spl3_3
| spl3_1 ),
inference(avatar_split_clause,[],[f218,f261,f269]) ).
thf(f218,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(duplicate_literal_removal,[],[f217]) ).
thf(f217,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f215]) ).
thf(f215,plain,
( ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(duplicate_literal_removal,[],[f209]) ).
thf(f209,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $true )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f208]) ).
thf(f208,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(duplicate_literal_removal,[],[f207]) ).
thf(f207,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( ( sK1 @ sK5 )
= $true ) ),
inference(binary_proxy_clausification,[],[f206]) ).
thf(f206,plain,
( ( $true
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( ( sK1 @ sK5 )
= $true )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f204]) ).
thf(f204,plain,
( ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f203]) ).
thf(f203,plain,
( ( $true
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( $true
= ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f201]) ).
thf(f201,plain,
( ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true )
| ( $true
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f170]) ).
thf(f170,plain,
( ( ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) )
| ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
= $true )
| ( ( ( ( sK2 @ sK5 )
| ( sK1 @ sK5 ) )
& ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
= $true ) ),
inference(binary_proxy_clausification,[],[f67]) ).
thf(f275,plain,
( spl3_3
| spl3_2 ),
inference(avatar_split_clause,[],[f255,f265,f269]) ).
thf(f255,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f254]) ).
thf(f254,plain,
( ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f252]) ).
thf(f252,plain,
( ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f251]) ).
thf(f251,plain,
( ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) ) ),
inference(binary_proxy_clausification,[],[f249]) ).
thf(f249,plain,
( ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK0 @ sK5 ) ) ),
inference(duplicate_literal_removal,[],[f248]) ).
thf(f248,plain,
( ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( sK0 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f233]) ).
thf(f233,plain,
( ( $true
= ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $true
= ( sK2 @ sK5 ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f232]) ).
thf(f232,plain,
( ( $true
= ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $true
= ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f202]) ).
thf(f202,plain,
( ( $true
= ( ( ( sK2 @ sK5 )
& ( sK0 @ sK5 ) )
| ( ( sK1 @ sK5 )
& ( sK2 @ sK5 ) ) ) )
| ( $true
= ( ( sK0 @ sK5 )
| ( sK2 @ sK5 ) ) )
| ( $true
= ( ( sK0 @ sK5 )
& ( sK1 @ sK5 ) ) ) ),
inference(binary_proxy_clausification,[],[f201]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET601^3 : TPTP v8.1.2. Released v3.6.0.
% 0.14/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n014.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 16:32:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_EQU_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.IzwTwQxVnu/Vampire---4.8_14130
% 0.15/0.38 % (14345)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % (14344)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.38 % (14347)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.38 % (14345)Instruction limit reached!
% 0.15/0.38 % (14345)------------------------------
% 0.15/0.38 % (14345)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14345)Termination reason: Unknown
% 0.15/0.38 % (14345)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (14345)Memory used [KB]: 895
% 0.15/0.38 % (14345)Time elapsed: 0.003 s
% 0.15/0.38 % (14345)Instructions burned: 2 (million)
% 0.15/0.38 % (14345)------------------------------
% 0.15/0.38 % (14345)------------------------------
% 0.15/0.38 % (14342)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.38 % (14343)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.38 % (14349)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.38 % (14348)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.38 % (14346)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.38 % (14346)Instruction limit reached!
% 0.15/0.38 % (14346)------------------------------
% 0.15/0.38 % (14346)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14346)Termination reason: Unknown
% 0.15/0.38 % (14346)Termination phase: shuffling
% 0.15/0.38
% 0.15/0.38 % (14346)Memory used [KB]: 895
% 0.15/0.38 % (14346)Time elapsed: 0.003 s
% 0.15/0.38 % (14346)Instructions burned: 2 (million)
% 0.15/0.38 % (14346)------------------------------
% 0.15/0.38 % (14346)------------------------------
% 0.15/0.38 % (14349)Instruction limit reached!
% 0.15/0.38 % (14349)------------------------------
% 0.15/0.38 % (14349)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14349)Termination reason: Unknown
% 0.15/0.38 % (14349)Termination phase: Preprocessing 3
% 0.15/0.38
% 0.15/0.38 % (14349)Memory used [KB]: 1023
% 0.15/0.38 % (14349)Time elapsed: 0.003 s
% 0.15/0.38 % (14349)Instructions burned: 3 (million)
% 0.15/0.38 % (14349)------------------------------
% 0.15/0.38 % (14349)------------------------------
% 0.15/0.38 % (14343)Instruction limit reached!
% 0.15/0.38 % (14343)------------------------------
% 0.15/0.38 % (14343)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (14343)Termination reason: Unknown
% 0.15/0.38 % (14343)Termination phase: Saturation
% 0.15/0.38
% 0.15/0.38 % (14343)Memory used [KB]: 5500
% 0.15/0.38 % (14343)Time elapsed: 0.004 s
% 0.15/0.38 % (14343)Instructions burned: 4 (million)
% 0.15/0.38 % (14343)------------------------------
% 0.15/0.38 % (14343)------------------------------
% 0.15/0.39 % (14344)First to succeed.
% 0.15/0.39 % (14348)Also succeeded, but the first one will report.
% 0.15/0.39 % (14342)Also succeeded, but the first one will report.
% 0.15/0.39 % (14344)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for Vampire---4
% 0.15/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.39 % (14344)------------------------------
% 0.15/0.39 % (14344)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.39 % (14344)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (14344)Memory used [KB]: 5628
% 0.15/0.39 % (14344)Time elapsed: 0.014 s
% 0.15/0.39 % (14344)Instructions burned: 10 (million)
% 0.15/0.39 % (14344)------------------------------
% 0.15/0.39 % (14344)------------------------------
% 0.15/0.39 % (14339)Success in time 0.027 s
% 0.15/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------